undirected graph

Design and a search set to calculate the connectivity of undirected graph branch algorithm.

设计用并查集来计算一个无向图的连通分支的算法.

A circ is an undirected graph having only vertices of even nonzero degree.

一广义圈是一无向图,其顶点次数都是非零偶数.

A method to build dimensioning model of 2 dimensional drawing based on undirected graph is presented.

提出了一种基于图结构描述的二维图形尺寸标注模型的建立及存储方法。

CRFs is a good undirected graph conditional probability model, mainly used to label and segment sequent data. CRFs model can get the global optimal label result using context features.

CRFs模型是目前比较优秀的无向图条件概率模型，主要用于标记和分割序列数据，可以利用上下文特征获得全局最优的标注结果。

Broadcast networks can be expressed by a simple connected undirected graph.

将广播网络用简单连通的无向图表示.

Markov network is an undirected graph, while Bayesian network is a directed acyclic graph.

Markov网是一个无向图, 而Bayesian网是一个有向无环图.

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。